Structural Patterns of Tractable Sequentially-Optimal Planning
نویسندگان
چکیده
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting numerous structural characteristics of planning problems, and a constructive proof technique that connects between certain tools from planning and tractable constraint optimization. In particular, we believe that structure-based tractability results of this kind may help devising new admissible search heuristics. We discuss the prospects of this direction along a principled extension of pattern-database heuristics to “structural patterns” of unlimited di-
منابع مشابه
Structural Patterns Heuristics: Basic Idea and Concrete Instance
Considering admissible heuristics for cost-optimal planning, we present a generalization of patterndatabase homomorphism abstractions, called “structural patterns”. The basic idea of structural patterns boils down to projecting the problem in hand to provably tractable fragments of optimal planning. The key motivation behind this generalization of PDBs is to alleviate the requirement for the pr...
متن کاملOptimal Additive Composition of Abstraction-based Admissible Heuristics
We describe a procedure that takes a classical planning task, a forward-search state, and a set of abstraction-based admissible heuristics, and derives an optimal additive composition of these heuristics with respect to the given state. Most importantly, we show that this procedure is polynomial-time for arbitrary sets of all known to us abstraction-based heuristics such as PDBs, constrained PD...
متن کاملStructural Patterns Heuristics via Fork Decomposition
We consider a generalization of the PDB homomorphism abstractions to what is called “structural patterns”. The basic idea is in abstracting the problem in hand into provably tractable fragments of optimal planning, alleviating by that the constraint of PDBs to use projections of only low dimensionality. We introduce a general framework for additive structural patterns based on decomposing the p...
متن کاملComplexity Results for State-variable Planning under Mixed Syntactical and Structural Restrictions
Most tractable planning problems reported in the literature have been deened by syntactical restrictions. To better exploit the inherent structure of problems, however, it is probably necessary to study also structural restrictions on the state-transition graph. We present an exhaustive map of complexity results for state-variable planning under all combinations of our previously analysed synta...
متن کاملNew Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimization is tractable, and identify certain conditions that differentiate between tractable and intractable problems. These results are based on exploiting both structural and syntactic characteristics of planning problems...
متن کامل